Approximation algorithms for capacitated stochastic inventory systems with setup costs
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for Capacitated Stochastic Inventory Systems with Setup Costs
We develop the first approximation algorithm with worst-case performance guarantee for capacitated stochastic periodic-review inventory systems with setup costs. The structure of the optimal control policy for such systems is extremely complicated, and indeed, only some partial characterization is available. Thus, finding provably near-optimal control policies has been an open challenge. In thi...
متن کاملApproximation Algorithms for Perishable Inventory Systems with Setup Costs
We develop the first approximation algorithm for periodic-review perishable inventory systems with setup costs. The ordering lead time is zero. The model allows for correlated demand processes which generalize the well-known approaches to model dynamic demand forecast updates. The structure of optimal policies for this fundamental class of problems is not known in the literature. Thus, finding ...
متن کاملApproximation Algorithms for Capacitated Stochastic Lot-sizing Inventory Control Models
Introduction. We study a class of capacitated stochastic lot-sizing inventory control problems with stochastic, non-stationary and correlated demands that evolve over time. Economies of scale and capacity constraints exist in many practical scenarios. However, models with fixed ordering costs and capacity constraints are typically computationally intractable, and even the structure of the optim...
متن کاملApproximation Algorithms for Capacitated Stochastic Inventory Control Models
We develop the first algorithmic approach to compute provably good ordering policies for a multi-period, capacitated, stochastic inventory system facing stochastic non-stationary and correlated demands that evolve over time. Our approach is computationally efficient and guaranteed to produce a policy with total expected cost no more than twice that of an optimal policy. As part of our computati...
متن کاملTechnical Note - Approximation Algorithms for Perishable Inventory Systems with Setup Costs
We develop the first approximation algorithm for periodic-review perishable inventory systems with setup costs. The ordering lead time is zero. The model allows for correlated demand processes which generalize the well-known approaches to model dynamic demand forecast updates. The structure of optimal policies for this fundamental class of problems is not known in the literature. Thus, finding ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Naval Research Logistics (NRL)
سال: 2014
ISSN: 0894-069X
DOI: 10.1002/nav.21584